Cycle spectra of Hamiltonian graphs

نویسندگان

  • Kevin G. Milans
  • Florian Pfender
  • Dieter Rautenbach
  • Friedrich Regen
  • Douglas B. West
چکیده

We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least √ 4 7(m − n) different lengths. The coefficient 4/7 cannot be increased above 1, since when m = n2/4 there are √ m − n + 1 cycle lengths in Kn/2,n/2. For general m and n there are examples having at most 2 ⌈

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric-Arithmetic Index of Hamiltonian Fullerenes

A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.

متن کامل

INTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

متن کامل

Cycle Spectra of Graphs

This thesis contains several new results about cycle spectra of graphs. The cycle spectrum of a graph G is the set of lengths of cycles in G. We focus on conditions which imply a rich cycle spectrum. We show a lower bound for the size of the cycle spectrum of cubic Hamiltonian graphs that do not contain a fixed subdivision of a claw as an induced subgraph. Furthermore, we consider cycle spectra...

متن کامل

NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs

The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195200) proved that the Hamiltonian Cycle Problem is NP-Complete even for undirected path graphs and left the Hamiltonian cycle problem open for directed path graphs. Narasimhan (1989, Information Processing Letters, 32, 167-170) proved tha...

متن کامل

The Hamiltonian Connected Property of Some Shaped Supergrid Graphs

A Hamiltonian path (cycle) of a graph is a simple path (cycle) which visits each vertex of the graph exactly once. The Hamiltonian path (cycle) problem is to determine whether a graph contains a Hamiltonian path (cycle). A graph is called Hamiltonian connected if there exists a Hamiltonian path between any two distinct vertices. Supergrid graphs were first introduced by us and include grid grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 102  شماره 

صفحات  -

تاریخ انتشار 2012